Combined Preorder and Postorder Traversal Algorithm for the Analysis of Singular Systems by Haar Wavelets
نویسندگان
چکیده
An efficient computational method is presented for state space analysis of singular systems via Haar wavelets. Singular systems are those in which dynamics are governed by a combination of algebraic and differential equations. The corresponding differential-algebraic matrix equation is converted to a generalized Sylvester matrix equation by using Haar wavelet basis. First, an explicit expression for the inverse of the Haar matrix is presented. Then, using it, we propose a combined preorder and postorder traversal algorithm to solve the generalized Sylvester matrix equation. Finally, the efficiency of the proposed method is discussed by a numerical example.
منابع مشابه
A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals
Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملA Computational Method for Solving Optimal Control Problem of Time-varying Singular Systems Using the Haar Wavelets
متن کامل
Wavelet-based numerical method for solving fractional integro-differential equation with a weakly singular kernel
This paper describes and compares application of wavelet basis and Block-Pulse functions (BPFs) for solving fractional integro-differential equation (FIDE) with a weakly singular kernel. First, a collocation method based on Haar wavelets (HW), Legendre wavelet (LW), Chebyshev wavelets (CHW), second kind Chebyshev wavelets (SKCHW), Cos and Sin wavelets (CASW) and BPFs are presented f...
متن کامل